Limit theory for geometric statistics of clustering point processes

نویسندگان

  • Bartlomiej Blaszczyszyn
  • D. Yogeshwaran
  • J. E. Yukich
چکیده

Let P be a simple, stationary, clustering point process on Rd in the sense that its correlation functions factorize up to an additive error decaying exponentially fast with the separation distance. Let Pn := P ∩Wn be its restriction to windows Wn := [− 1/d 2 , n1/d 2 ] d ⊂ Rd. We consider the statistic H n := ∑ x∈Pn ξ(x,Pn) where ξ(x,Pn) denotes a score function representing the interaction of x with respect to Pn. When ξ depends on local data in the sense that its radius of stabilization has an exponential tail, we establish expectation asymptotics, variance asymptotics, and central limit theorems for H n and, more generally, for statistics of the random measures μn := ∑ x∈Pn ξ(x,Pn)δn−1/dx, asWn ↑ R d. This gives the limit theory for non-linear geometric statistics (such as clique counts, the number of Morse critical points, intrinsic volumes of the Boolean model, and total edge length of the k-nearest neighbor graph) of determinantal point processes having fast decreasing kernels, including the β-Ginibre ensembles, extending the Gaussian fluctuation results of Soshnikov [68] to non-linear statistics. It also gives the limit theory for geometric U-statistics of α-permanental point processes (for 1/α ∈ N), α-determinantal point processes (for −1/α ∈ N), as well as the zero set †Research supported in part by DST-INSPIRE faculty award and TOPOSYS Grant. ‡Research supported in part by NSF grant DMS-1406410

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Weak laws in geometric probability

Using a coupling argument, we establish a general weak law of large numbers for functionals of binomial point processes in d-dimensional space, with a limit that depends explicitly on the (possibly non-uniform) density of the point process. The general result is applied to the minimal spanning tree, the k-nearest neighbors graph, the Voronoi graph, and the sphere of influence graph. Functionals...

متن کامل

A robust wavelet based profile monitoring and change point detection using S-estimator and clustering

Some quality characteristics are well defined when treated as response variables and are related to some independent variables. This relationship is called a profile. Parametric models, such as linear models, may be used to model profiles. However, in practical applications due to the complexity of many processes it is not usually possible to model a process using parametric models.In these cas...

متن کامل

Target detection Bridge Modelling using Point Cloud Segmentation Obtained from Photogrameric UAV

In recent years, great efforts have been made to generate 3D models of urban structures in photogrammetry and remote sensing. 3D reconstruction of the bridge, as one of the most important urban structures in transportation systems, has been neglected because of its geometric and structural complexity. Due to the UAV technology development in spatial data acquisition, in this study, the point cl...

متن کامل

CONSTANT STRESS ACCELERATED LIFE TESTING DESIGNWITH TYPE-II CENSORING SCHEME FOR PARETO DISTRIBUTION USING GEOMETRIC PROCESS

In many of the studies concerning Accelerated life testing (ALT), the log linear function between life and stress which is just a simple re-parameterization of the original parameter of the life distribution is used to obtain the estimates of original parameters but from the statistical point of view, it is preferable to work with the original parameters instead of developing inferences for the...

متن کامل

The information bottleneck and geometric clustering

The information bottleneck (IB) approach to clustering takes a joint distribution P (X,Y ) and maps the data X to cluster labels T which retain maximal information about Y (Tishby et al., 1999). This objective results in an algorithm that clusters data points based upon the similarity of their conditional distributions P (Y | X). This is in contrast to classic “geometric clustering” algorithms ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1606.03988  شماره 

صفحات  -

تاریخ انتشار 2016